import math
n = int(input())
names = [0]*26
for _ in range(n):
student = input()
names[ord(student[0])-97] += 1
total = [x for x in names if x > 0]
pairs = 0
for i in total:
pairs += math.comb(math.ceil(i/2), 2) + math.comb(math.floor(i/2), 2)
print(pairs)
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pb push_back
#define fastread() (ios_base:: sync_with_stdio(false),cin.tie(NULL));
using namespace std;
int main()
{
long long n;
char c;
map<char,int>mp;
map<char,int>:: iterator itr;
string s;
cin>>n;
while(n--){
cin>>s;
c = s[0];
mp[c]++;
}
int a,one,sec,sum = 0;
for(itr=mp.begin(); itr!=mp.end(); itr++){
a = itr->second;
one = (a / 2) + (a % 2);
sec = a/2;
while(one--){
sum += one;
}
while(sec--){
sum += sec;
}
}
cout<<sum<<endl;
return 0;
}
969. Pancake Sorting | 967. Numbers With Same Consecutive Differences |
957. Prison Cells After N Days | 946. Validate Stack Sequences |
921. Minimum Add to Make Parentheses Valid | 881. Boats to Save People |
497. Random Point in Non-overlapping Rectangles | 528. Random Pick with Weight |
470. Implement Rand10() Using Rand7() | 866. Prime Palindrome |
1516A - Tit for Tat | 622. Design Circular Queue |
814. Binary Tree Pruning | 791. Custom Sort String |
787. Cheapest Flights Within K Stops | 779. K-th Symbol in Grammar |
701. Insert into a Binary Search Tree | 429. N-ary Tree Level Order Traversal |
739. Daily Temperatures | 647. Palindromic Substrings |
583. Delete Operation for Two Strings | 518. Coin Change 2 |
516. Longest Palindromic Subsequence | 468. Validate IP Address |
450. Delete Node in a BST | 445. Add Two Numbers II |
442. Find All Duplicates in an Array | 437. Path Sum III |
436. Find Right Interval | 435. Non-overlapping Intervals |